منابع مشابه
Median and quasi-median direct products of graphs
Median graphs are characterized among direct products of graphs on at least three vertices. Beside some trivial cases, it is shown that one component of G × P3 is median if and only if G is a tree in that the distance between any two vertices of degree at least 3 is even. In addition, some partial results considering median graphs of the form G ×K2 are proved, and it is shown that the only nonb...
متن کاملImproved visibility of character conflicts in quasi-median networks with the EMPOP NETWORK software
AIM To provide a valuable tool for graphical representation of mitochondrial DNA (mtDNA) data that enables visual emphasis on complex substructures within the network to highlight possible ambiguities and errors. METHOD We applied the new NETWORK graphical user interface, available via EMPOP (European DNA Profiling Group Mitochondrial DNA Population Database; www.empop.org) by means of two mt...
متن کاملComputing the blocks of a quasi-median graph
Quasi-median graphs are a tool commonly used by evolutionary biologists to visualise the evolution of molecular sequences. As with any graph, a quasi-median graph can contain cut vertices, that is, vertices whose removal disconnect the graph. These vertices induce a decomposition of the graph into blocks, that is, maximal subgraphs which do not contain any cut vertices. Here we show that the sp...
متن کاملConcept Lattices and Median Networks
In phylogenetic analysis, median networks have been proposed as an improvement over tree representations. This paper argues that concept lattices represent a further improvement over median networks because FCA provides a detailed formal description and there are a number of existing software solutions for creating lattices. The purpose of this paper is to raise awareness in the FCA community f...
متن کاملLocating median cycles in networks
In the median cycle problem the aim is to determine a simple cycle through a subset of vertices of a graph involving two types of costs: a routing cost associated with the cycle itself, and the cost of assigning vertices not on the cycle to visited vertices. The objective is to minimize the routing cost, subject to an upper bound on the total assignment cost. This problem arises in the location...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2011
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.06.011